Proof Pearl: Abella Formalization of λ-Calculus Cube Property
نویسنده
چکیده
In 1994 Gerard Huet formalized in Coq the cube property of λ-calculus residuals. His development is based on a clever idea, a beautiful inductive definition of residuals. However, in his formalization there is a lot of noise concerning the representation of terms with binders. We re-interpret his work in Abella, a recent proof assistant based on higher-order abstract syntax and provided with a nominal quantifier. By revisiting Huet’s approach and exploiting the features of Abella, we get a strikingly compact and natural development, which makes Huet’s idea really shine.
منابع مشابه
The Abella Interactive Theorem Prover (System Description)
Abella [3] is an interactive system for reasoning about aspects of object languages that have been formally presented through recursive rules based on syntactic structure. Abella utilizes a two-level logic approach to specification and reasoning. One level is defined by a specification logic which supports a transparent encoding of structural semantics rules and also enables their execution. Th...
متن کاملExtracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracted from it. Unlike many other proofs of weak normalization based on Tait’s strong computability predicates, which require a logic supporting strong eliminations and can give rise to dependent types in the extracted prog...
متن کاملSystem Description: Abella -- A System for Reasoning about Computations
Abella [Gac08] is an interactive theorem prover for reasoning about the properties of an object language that is described through structural operational semantics style rules. Abella is based on a two-level logic approach to specification and reasoning. One level is defined by a specification logic which supports a transparent encoding of structural operational semantics rules and also enables...
متن کاملUnified Classical Logic Completeness - A Coinductive Pearl
Codatatypes are absent from many programming and specification languages. We make a case for their importance by revisiting a classical result: the completeness theorem for first-order logic established through a Gentzen system. The core of the proof establishes an abstract property of possibly infinite derivation trees, independently of the concrete syntax or inference rules. This separation o...
متن کاملThe Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especially interesting from a logical point of view. Strong normalization, an essential property for logical soundness, had only been conjectured so far: in this paper, we give a positive answer for the simply-typed system. The pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012